基于稳定连接的配电网边缘划分方法及应用研究

随着能源互联网的建设,为了应对配电主站所面临的数据接入和计算压力,文章提出了二级配电网边缘架构,以分布式边缘智能架构缓解主站压力。主要从边缘定义、划分方法、边缘功能描述与交互描述4个方面对所提边缘架构进行介绍。提出电网稳定连接区域概念及其生成方法,并结合南京地区电网实例,说明了以电网稳定连接区域作为边缘划分的合理性。最后,对所提边缘架构在配电网中的实际应用场景进行了设计和展望。     

A Mobile Cloud-Based eHealth Scheme

Mobile cloud computing is an emerging field that is gaining popularity across borders at a rapid pace. Similarly, the field of health informatics is also considered as an extremely important field. This work observes the collaboration between these two fields to solve the traditional problem of extracting Electrocardiogram signals from trace reports and then performing analysis. The developed system has two front ends, the first dedicated for the user to perform the photographing of the trace report. Once the photographing is complete, mobile computing is used to extract the signal. Once the signal is extracted, it is uploaded into the server and further analysis is performed on the signal in the cloud. Once this is done, the second interface, intended for the use of the physician, can download and view the trace from the cloud. The data is securely held using a password-based authentication method. The system presented here is one of the first attempts at delivering the total solution, and after further upgrades, it will be possible to deploy the system in a commercial setting.     

High Accuracy Network Cardinalities Estimation by Step Sampling Revision on GPU

Host cardinality estimation is an important research field in network management and network security. The host cardinality estimation algorithm based on the linear estimator array is a common method. Existing algorithms do not take memory footprint into account when selecting the number of estimators used by each host. This paper analyzes the relationship between memory occupancy and estimation accuracy and compares the effects of different parameters on algorithm accuracy. The cardinality estimating algorithm is a kind of random algorithm, and there is a deviation between the estimated results and the actual cardinalities. The deviation is affected by some systematical factors, such as the random parameters inherent in linear estimator and the random functions used to map a host to different linear estimators. These random factors cannot be reduced by merging multiple estimators, and existing algorithms cannot remove the deviation caused by such factors. In this paper, we regard the estimation deviation as a random variable and proposed a sampling method, recorded as the linear estimator array step sampling algorithm (L2S), to reduce the influence of the random deviation. L2S improves the accuracy of the estimated cardinalities by evaluating and remove the expected value of random deviation. The cardinality estimation algorithm based on the estimator array is a computationally intensive algorithm, which takes a lot of time when processing high-speed network data in a serial environment. To solve this problem, a method is proposed to port the cardinality estimating algorithm based on the estimator array to the Graphics Processing Unit (GPU). Experiments on real-world highspeed network traffic show that L2S can reduce the absolute bias by more than 22% on average, and the extra time is less than 61 milliseconds on average.     

Improving scenario decomposition algorithms for robust nonlinear model predictive control

This paper deals with the efficient computation of solutions of robust nonlinear model predictive control problems that are formulated using multi-stage stochastic programming via the generation of a scenario tree. Such a formulation makes it possible to consider explicitly the concept of recourse, which is inherent to any receding horizon approach, but it results in large-scale optimization problems. One possibility to solve these problems in an efficient manner is to decompose the large-scale optimization problem into several subproblems that are iteratively modified and repeatedly solved until a solution to the original problem is achieved. In this paper we review the most common methods used for such decomposition and apply them to solve robust nonlinear model predictive control problems in a distributed fashion. We also propose a novel method to reduce the number of iterations of the coordination algorithm needed for the decomposition methods to converge. The performance of the different approaches is evaluated in extensive simulation studies of two nonlinear case studies.     

美军全舰计算环境基础设施标准化设计方法探析磁

论文从硬件设备、软件服务、数据资源和任务调度等几个方面对美国海军在开发构建全舰计算环境基础设施过程中标准化的设计方法进行深入分析。通过采用标准化的计算、显示、存储等硬件资源并进行整合，提升硬件资源的利用效率和共用水平；开发各个层次的公共应用功能软件并形成标准化的服务，将软件和硬件解耦，达到应用与数据分离，使得基于TSCEI的信息化装备的构建更加快速灵活，开放性更好，可扩展性及升级能力大为增强。标准化在 TSCEI的推行和实施中起着至关重要的作用。标准化设计方法对构建我军新型信息基础设施具有较重要的借鉴作用。     

Simplifying the powder metallurgy manufacturing process using soft computing tools

The tools of soft computing will aid the knowledge mining in predicting and classifying the properties of various parameters while designing the composite preforms in the manufacturing of Powder Metallurgy (P/M) Lab. In this paper, an integrated PRNET (PCA-Radial basis functional neural NET) model is proposed in different versions to select the relevant parameters for preparing composite preforms and to predict the deformation and strain hardening properties of Al–Fe composites. It reveals that the predictability of this model has been increased by 67.89% relatively from the conventional models. A new PR-filter is proposed by slightly modifying the conventional filters of RBFNN, which improves the power of PRNET even though raw data are highly non-linear, interrelated and noisy. Moreover, fixing the range of input parameters for classifying the properties of composite preforms can be automated by the Fuzzy logic. These types of models will avoid expensive experimentation and risky environment while preparing sintered composite preforms. Thus the manufacturing process of composites in P/M Lab will be simplified with minimum energy by the support of these soft-computing tools.     

A geospatial framework to support integrated biogeochemical modelling in the United Kingdom

Anthropogenic impacts on the aquatic environment, especially in the context of nutrients, provide a major challenge for water resource management. The heterogeneous nature of policy relevant management units (e.g. catchments), in terms of environmental controls on nutrient source and transport, leads to the need for holistic management. However, current strategies are limited by current understanding and knowledge that is transferable between spatial scales and landscape typologies. This study presents a spatially-explicit framework to support the modelling of nutrients from land to water, encompassing environmental and spatial complexities. The framework recognises nine homogeneous landscape units, distinct in terms of sensitivity of nutrient losses to waterbodies. The functionality of the framework is demonstrated by supporting an exemplar nutrient model, applied within the Environmental Virtual Observatory pilot (EVOp) cloud cyber-infrastructure. We demonstrate scope for the use of the framework as a management decision support tool and for further development of integrated biogeochemical modelling.     

适应于自动驾驶的计算结构与平台综述

信息与通信技术领域的不断发展,推动了自动驾驶汽车的巨大进步。自动驾驶汽车有效解决了用户对出行日益提高的安全、便捷、舒适、高效等个性化需求,有着巨大的商业前景和应用价值。首先从自动驾驶的定义出发,对自动驾驶汽车计算任务进行了分类总结,阐述了自动驾驶汽车集移动端、边缘节点和云端一体的计算结构。然后分类讨论了目前自动驾驶汽车移动端计算平台,呈现出异构多核的特点,并对当前主流的底层计算平台进行了对比分析。最后,从性能与成本和信息安全两个方面总结目前自动驾驶汽车计算结构和平台遇到的问题与挑战。     

Model-Based Design Space Exploration for FPGA-based Image Processing Applications Employing Parameterizable Approximations

The increasing demand for low power consumption and high computational performance is outpacing available technological improvements in embedded systems. Approximate computing is a novel design paradigm trying to bridge this gap by leveraging the inherent error resilience of certain applications and trading in quality to achieve reductions in resource usage. Numerous approximation methods have emerged in this research field. While these methods are commonly demonstrated in isolation, their combination can increase the achieved benefits in complex systems. However, the propagation of errors throughout the system necessitates a global optimization of parameters, leading to an exponentially growing design space. Additionally, the parameterization of approximated components must consider potential cross-dependencies between them. This work proposes a systematic approach to integrate and optimally configure parameterizable approximate components in FPGA-based applications, focusing on low-level but high-bandwidth image processing pipelines. The design space is explored by a multi-objective genetic algorithm which takes parameter dependencies between different components into account. During the exploration, appropriate models are used to estimate the quality-resource trade-off for probed solutions without the need for time-consuming synthesis. We demonstrate and evaluate the effectiveness of our approach on two image processing applications that employ multiple approximations. The experimental results show that the proposed methods are able to produce a wide range of Pareto-optimal solutions, offering various choices regarding the desired quality-resource trade-off.